Vertex-Transitive Digraphs of Order $p^5$ are Hamiltonian
نویسنده
چکیده
We prove that connected vertex-transitive digraphs of order p5 (where p is a prime) are Hamiltonian, and a connected digraph whose automorphism group contains a finite vertex-transitive subgroup G of prime power order such that G′ is generated by two elements or elementary abelian is Hamiltonian.
منابع مشابه
Polynomial algorithms for finding paths and cycles in quasi-transitive digraphs
A digraph D is called quasi-transitive if for any triple x, y, z of distinct vertices of D such that (x, y) and (y, z) are arcs of D there is at least one arc from x to z or from z to x. A minimum path factor of a digraph D is a collection of the minimum number of pairwise vertex disjoint paths covering the vertices of D. J. Bang-Jensen and J. Huang conjectured that there exist polynomial algor...
متن کاملar X iv : m at h / 06 06 58 5 v 1 [ m at h . C O ] 2 3 Ju n 20 06 HAMILTONICITY OF VERTEX - TRANSITIVE GRAPHS OF ORDER 4 p
It is shown that every connected vertex-transitive graph of order 4p, where p is a prime, is hamiltonian with the exception of the Coxeter graph which is known to possess a Hamilton path. In 1969, Lovász [22] asked if every finite, connected vertex-transitive graph has a Hamilton path, that is, a path going through all vertices of the graph. With the exception of K 2 , only four connected verte...
متن کاملPermutation Groups, Vertex-transitive Digraphs and Semiregular Automorphisms
A nonidentity element of a permutation group is said to be semiregular if all of its orbits have the same length. The work in this paper is linked to [6] where the problem of existence of semiregular automorphisms in vertex-transitive digraphs was posed. It was observed there that every vertex-transitive digraph of order pk or mp, where p is a prime, k 1 and m p are positive integers, has a sem...
متن کاملSome Non-Normal Cayley Digraphs of the Generalized Quaternion Group of Certain Orders
We show that an action of SL(2, p), p ≥ 7 an odd prime such that 4 6 | (p − 1), has exactly two orbital digraphs Γ1, Γ2, such that Aut(Γi) admits a complete block system B of p + 1 blocks of size 2, i = 1, 2, with the following properties: the action of Aut(Γi) on the blocks of B is nonsolvable, doubly-transitive, but not a symmetric group, and the subgroup of Aut(Γi) that fixes each block of B...
متن کاملVertex heaviest paths and cycles in quasi-transitive digraphs
A digraph D is called a quasi-transitive digraph (QTD) if for any triple x, y, z of distinct vertices of D such that (x, y) and (y, z) are arcs of D there is at least one arc from x to z or from z to x. Solving a conjecture by J. Bang-Jensen and J. Huang (J. Graph Theory, to appear), G. Gutin (Australas. J. Combin., to appear) described polynomial algorithms for finding a Hamiltonian cycle and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 22 شماره
صفحات -
تاریخ انتشار 2015